Improved Approach for Exact Pattern Matching

نویسندگان

  • Iftikhar Hussain
  • Samina Kausar
  • Liaqat Hussain
  • Muhammad Asif Khan
چکیده

In this research we present Bidirectional exact pattern matching algorithm [20] in detail. Bidirectional (BD) exact pattern matching (EPM) introduced a new idea to compare pattern with Selected Text Window (STW) of text string by using two pointers (right and left) simultaneously in searching phase. In preprocessing phase Bidirectional EPM algorithm improved the shift decision by comparing rightmost and mismatched character of Partial Text Window (PTW) to the left of pattern at same shift length. The time complexity of preprocessing phase of BD exact pattern matching is O(m) and searching phase takes O(mn/2). The proposed Bidirectional EPM algorithm is effective than the number of existing algorithms in many cases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

Improved-Bidirectional Exact Pattern Matching

In this research, we present an improved version of Bidirectional (BD) exact pattern matching (EPM) algorithm to solve the problem of exact pattern matching. Improved-Bidirectional (IBD) exact pattern matching algorithm introduced a new idea of scanning partial text window (PTW) as well with the pattern to take decision of moving pattern to the right of partial text window. IBD algorithm compar...

متن کامل

Jumbled Matching with SIMD

Jumbled pattern matching addresses the problem of finding all permuted occurrences of a substring in a text. We introduce two improved algorithms for exact jumbled matching of short patterns. Our solutions apply SIMD (Single Instruction Multiple Data) computation in order to quickly filter the text. One of them utilizes the equal any operation and the other searches for the least frequent chara...

متن کامل

Implementation of exact-pattern matching algorithms using OpenCL and comparison with basic version

In big text-processing tasks, the exact patternmatching problem still remains time consuming. As algorithms asymptotically faster than existing ones cannot be developed, there is a need to use another approach to promote efficiency. Thus, parallel computing is able to significantly speed up the process of the exact pattern-matching problem solving. That is why the current work is focused on par...

متن کامل

Inexact Pattern Matching Algorithms via Automata

Pattern matching occurs in various applications, ranging from simple text searching in word processors to identification of common motifs in DNA sequences in computational biology. The problem of exact pattern matching has been well studied and a number of efficient algorithms exist. However these exact pattern matching algorithms are of little help when they are applied to finding patterns in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013